Chemical Graphs: Looking Back and Glimpsing Ahead

نویسنده

  • Alexandru T. Balaban
چکیده

Graph-theoretical applications to chemistry are reviewed from a personal point of view in the context of the gradual acceptance of the value of such applications by the chemical and informational community. Initial problems involved enumerations of isomers that required the use of molecular (constitutional) graphs and techniques such as Polya’s theorem, including valence isomers of annulenes, benzenoids, and diamond hydrocarbons (polymantanes). Problems connected with structural coding and retrieval of chemical information followed. Reaction graphs exemplify a different type of graphs. For QSAWQSPR studies, global graph invariants (topological indices, TIS) have proved their usefulness; they are based on local vertex invariants (LOVIs) which until recently were exclusively integers, leading to high degeneracy of TIS. Newly introduced real-number LOVIs are briefly reviewed. This retrospective section ends with applications of graph theory (GT) to elemental carbon nets and to fullerenes. Then a few predictions are made for promising developments in the future: increasing use of GT for information processing, development of LOVIs and TIS incorporating stereochemical features, and increased use of TIS for molecular modeling and drug design, along with more sophisticated molecular graphics methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Classifier Systems: Looking Back and Glimpsing Ahead

Over the recent years, research on Learning Classifier Systems (LCSs) got more and more pronounced and diverse. There have been significant advances of the LCS field on various fronts including system understanding, representations, computational models, and successful applications. In comparison to other machine learning techniques, the advantages of LCSs have become more pronounced: (1) rulec...

متن کامل

Experimenting with Look-Back Heuristics for Hard ASP Programs

Competitive native solvers for Answer Set Programming (ASP) perform a backtracking search by assuming the truth of literals. The choice of literals (the heuristic) is fundamental for the performance of these systems. Most of the efficient ASP systems employ a heuristic based on look-ahead, that is, a literal is tentatively assumed and its heuristic value is based on its deterministic consequenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Chemical Information and Computer Sciences

دوره 35  شماره 

صفحات  -

تاریخ انتشار 1995